Purifying Causal Atomicity
نویسندگان
چکیده
Atomicity-checking is a powerful approach for finding subtle concurrency errors in shared-memory multithreaded code. The goal is to verify that certain code sections appear to execute atomically to all other threads. This paper extends Farzan and Madhusudan’s recent work on causal atomicity [1], which uses a translation to Petri nets to avoid much of the imprecision of type-system based approaches, to support purity annotations in the style of Flanagan et al. [2]. Purity avoids imprecision for several key idioms, but it has previously been used only in the typesystem setting. Our work is (1) compositional : a different purity analysis could be implemented with minimal extra effort, and similarly another atomicity criterion could be checked without changing the purity analysis, and (2) a conservative extension: the analysis of any program that does not use purity annotations is equivalent to the original analysis.
منابع مشابه
Causal Atomicity
Atomicity is an important generic specification that assures that a programmer can pretend blocks occur sequentially in any execution. We define a notion of atomicity based on causality. We model the control flow of a program with threads using a Petri net that naturally abstracts data, and faithfully captures the independence and interaction between threads. The causality between events in the...
متن کاملMaximal Causal Models for Sequentially Consistent Multithreaded Systems
This paper shows that it is possible to build a theoretically maximal and sound causal model for concurrent computations from a given execution trace. For an observed execution, the proposed model comprises all consistent executions which can be derived from it using only knowledge about the execution machine. The existence of such a model is of great theoretical value. First, by comprising all...
متن کاملRelativistic Causal Ordering - A Memory Model for Scalable Concurrent Data Structures
High-performance programs and systems require concurrency to take full advantage of available hardware. However, the available concurrent programming models force a difficult choice, between simple models such as mutual exclusion that produce little to no concurrency, or complex models such as Read-Copy Update that can scale to all available resources. Simple concurrent programming models enfor...
متن کاملCausal set topology
The Causal Set Theory (CST) approach to quantum gravity is motivated by the observation that, associated with any causal spacetime (M,g) is a poset (M,≺), with the order relation ≺ corresponding to the spacetime causal relation. Spacetime in CST is assumed to have a fundamental atomicity or discreteness, and is replaced by a locally finite poset, the causal set. In order to obtain a well define...
متن کاملEffective Predictive Runtime Analysis Using Sliced Causality and Atomicity
Predictive runtime analysis has been proposed to improve the effectiveness of concurrent program analysis and testing. By observing one execution trace of the running system, predictive runtime analysis extracts a causality relation among runtime events, which is then used as an abstract model of the program and checked against desired properties. This way, one can predict concurrency errors wi...
متن کامل